منابع مشابه
Heuristics for Semirandom Graph Problems
We consider semirandom graph models for nding large independent sets, colorings and bisections in graphs. These models generate problem instances by blending random and adversarial decisions. To generate semirandom independent set problems, an independent set S of n ver-tices is randomly chosen. Each edge connecting S with S is chosen with probability p, and an adversary is then allowed to add ...
متن کاملPlanning graph based heuristics for Partial Satisfaction Problems
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Hence, this requires finding plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modelling and handling plan quality (in terms of action costs and goal utilities). Despite the ...
متن کاملParameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in nu...
متن کاملHeuristics for Multidimensional Packing Problems
In this thesis we consider solution methods for packing problems. Packing problems occur in manydifferent situations both directly in the industry and as sub-problems of other problems. High-qualitysolutions for problems in the industrial sector may be able to reduce transportation and productioncosts significantly. For packing problems in general are given a set of items and one of...
متن کاملSeed-growth Heuristics for Graph Bisection
We investigate a family of algorithms for graph bisection that are based on a simple local connectivity heuristic, which we call seedgrowth. We show how the heuristic can be combined with stochastic search procedures and a postprocess application of the KernighanLin algorithm. In a series of time-equated comparisons against largesample runs of pure Kernighan-Lin, the new algorithms nd bisection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1773